A Primal-Dual Simulation Algorithm for Pricing Multi-Dimensional American Options

نویسندگان

  • Leif Andersen
  • Mark Broadie
چکیده

This paper describes a practical algorithm based on Monte Carlo simulation for the pricing of multi-dimensional American (i.e., continuously exercisable) and Bermudan (i.e., discretelyexercisable) options. The method generates both lower and upper bounds for the Bermudan option price and hence gives valid confidence intervals for the true value. Lower bounds can be generated using any number of primal algorithms. Upper bounds are generated using a new Monte Carlo algorithm based on the duality representation of the Bermudan value function suggested independently in Haugh and Kogan (2001) and Rogers (2001). Our proposed algorithm can handle virtually any type of process dynamics, factor structure, and payout specification. Computational results for a variety of multi-factor equity and interest rate options demonstrate the simplicity and efficiency of the proposed algorithm. In particular, we use the proposed method to examine and verify the tightness of frequently used exercise rules in Bermudan swaption markets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Primal-Dual Simulation Algorithm for Pricing Multidimensional American Options

T paper describes a practical algorithm based on Monte Carlo simulation for the pricing of multidimensional American (i.e., continuously exercisable) and Bermudan (i.e., discretely exercisable) options. The method generates both lower and upper bounds for the Bermudan option price and hence gives valid confidence intervals for the true value. Lower bounds can be generated using any number of pr...

متن کامل

A Reduced Basis Method for the Simulation of American Options

We present a reduced basis method for the simulation of American option pricing. To tackle this model numerically, we formulate the problem in terms of a time dependent variational inequality. Characteristic ingredients are a POD-greedy and an angle-greedy procedure for the construction of the primal and dual reduced spaces. Numerical examples are provided, illustrating the approximation qualit...

متن کامل

Improved Lower and Upper Bound Algorithms for Pricing American Options by Simulation

This paper introduces new variance reduction techniques and computational improvements to Monte Carlo methods for pricing American-style options. For simulation algorithms that compute lower bounds of American option values, we apply martingale control variates and introduce the local policy enhancement, which adopts a local simulation to improve the exercise policy. For duality-based upper bou...

متن کامل

Parallel Pricing Algorithms for Multi--Dimensional Bermudan/American Options using Monte Carlo methods

In this paper we present two parallel Monte Carlo based algorithms for pricing multi–dimensional Bermudan/American options. First approach relies on computation of the optimal exercise boundary while the second relies on classification of continuation and exercise values. We also evaluate the performance of both the algorithms in a desktop grid environment. We show the effectiveness of the prop...

متن کامل

Approximate Dynamic Programming (ADP) and Dual Methods for Pricing American Options

It is only recently that simulation has begun to play an important role in pricing high-dimensional American options. This was due to the fact that since Monte Carlo simulation generally works forward in time while dynamic programming works backwards, it was generally believed that the two were somewhat incompatible. Research in recent years has shown that this is not the case and that Monte Ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001